Cellular-based Population to Enhance Genetic Algorithm for Assignment Problems
نویسندگان
چکیده
In this paper, we describe a new mechanism of cellular selection as an improved Genetic Algorithm for some optimization problems like Cellular Channel assignment, which have multi feasible/optimum solution per one case. Considering the problems and the nature of relationship among individuals in population, we use 2-dimension Cellular Automata in order to place the individuals onto its cells to make the locality and neighborhood on the Hamming distance basis. This idea as 2D Cellular Automata Hamming GA has introduced locality in Genetic Algorithms and global knowledge for their selection process on Cells of 2D Cellular Automata. The selection based on 2D Cellular Automata can ensure maintaining population diversity and fast convergence in the genetic search. The cellular selection of individuals is controlled based on the structure of cellular automata, to prevent the fast population diversity loss and improve the convergence performance during the genetic search.
منابع مشابه
A population-based algorithm for the railroad blocking problem
Railroad blocking problem (RBP) is one of the problems that need an important decision in freight railroads. The objective of solving this problem is to minimize the costs of delivering all commodities by deciding which inter-terminal blocks to build and by specifying the assignment of commodities to these blocks, while observing limits on the number and cumulative volume of the blocks assemble...
متن کاملA genetic algorithm for a bi-objective mathematical model for dynamic virtual cell formation problem
Nowadays, with the increasing pressure of the competitive business environment and demand for diverse products, manufacturers are force to seek for solutions that reduce production costs and rise product quality. Cellular manufacturing system (CMS), as a means to this end, has been a point of attraction to both researchers and practitioners. Limitations of cell formation problem (CFP), as one o...
متن کاملCell forming and cell balancing of virtual cellular manufacturing systems with alternative processing routes using genetic algorithm
Cellular manufacturing (CM) is one of the most important subfields in the design of manufacturing systems and as a recently emerged field of study and practice, virtual cellular manufacturing (VCM) inherits the importance from CM. One type of VCM problems is VCM with alternative processing routes from which the route for processing each part should be selected. In this research, a bi-objective ...
متن کاملA Similarity-based Cellular Selection Mechanisim for Genetic algorithms to Solve Assignment Problems
In this paper, we illustrate a cellular structure mixed with Genetic Algorithms for solving assignment problems which have more than one feasible or optimum solution. Considering similarity among individuals in population, we use two dimensions Cellular Automata in order to place the individuals onto its cells to make the locality and neighborhood on Hamming distance basis. This new structure a...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کامل